Adjacency-like conditions and induced ideal graphs
نویسندگان
چکیده
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We the interplay between multiplicative theory graph theoretic structure associated graph. Behavior under standard ring extensions are studied, in conjunction with theory, classical results connections made.
منابع مشابه
Adjacency posets of planar graphs
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimension 5. We then show that the dimension of the adjacency poset of an outerplanar graph is at most 5. From below, we show that there is an outerplanar graph whose adjacency poset has dimension 4. We also show that the dim...
متن کاملAdjacency Graphs, Irreducible Polynomials and Cyclotomy
We consider the adjacency graphs of linear feedback shift registers (LFSRs) with reducible characteristic polynomials. Let l(x) be a characteristic polynomial, and l(x) = l1(x)l2(x) · · · lr(x) be a decomposition of l(x) into co-prime factors. Firstly, we show a connection between the adjacency graph of FSR(l(x)) and the association graphs of FSR(li(x)), 1 ≤ i ≤ r. By this connection, the probl...
متن کاملNilpotent Adjacency Matrices and Random Graphs
While powers of the adjacency matrix of a finite graph reveal information about walks on the graph, they fail to distinguish closed walks from cycles. Using elements of an appropriate commutative, nilpotentgenerated algebra, a “new” adjacency matrix can be associated with a random graph on n vertices and |E| edges of nonzero probability. Letting Xk denote the number of k-cycles occurring in a r...
متن کاملStrongly adjacency-transitive graphs and uniquely shift-transitive graphs
An automorphism of a 7nite simple graph is an adjacency automorphism if for every vertex x∈V ( ), either x = x or x is adjacent to x in . An adjacency automorphism 7xing no vertices is a shift. A connected graph is strongly adjacency-transitive (respectively, uniquely shift-transitive) if there is, for every pair of adjacent vertices x; y∈V ( ), an adjacency automorphism (respectively, a unique...
متن کاملCombinatorics on Adjacency Graphs and Incidence Pseudographs
The paper starts with a brief review of combinatorial results for adjacency and oriented adjacency graphs (combinatorial maps). The main subject is incidence pseudographs (a dual of cell complexes) of the n-dimensional orthogonal grid. It is well known that these pseudographs (or complexes) allow a definition of a topological space, and combinatorial formulas are provided for characterizing ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2023
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2023.2187625